Characterizations of regular magic graphs
نویسندگان
چکیده
منابع مشابه
Characterizations of regular magic graphs
A graph is magic if the edges can be labeled with nonnegative real numbers such that (i) different edges have distinct labels, and (ii) the sum of the labels of edges incident to each vertex is the same. Regular magic graphs are characterized herein by the nonappearance of certain bipartite subgraphs. This implies that line connectivity is a crucial property for characterizing regular magic gra...
متن کاملMagic labelings of regular graphs
Let G(V,E) be a graph and λ be a bijection from the set V ∪E to the set of the first |V |+ |E| natural numbers. The weight of a vertex is the sum of its label and the labels of all adjacent edges. We say λ is a vertex magic total (VMT) labeling of G if the weight of each vertex is constant. We say λ is an (s, d) -vertex antimagic total (VAT) labeling if the vertex weights form an arithmetic pro...
متن کاملAlgebraic characterizations of distance-regular graphs
We survey some old and some new characterizations of distance-regular graphs, which depend on information retrieved from their adjacency matrix. In particular, it is shown that a regular graph with d+ 1 distinct eigenvalues is distance-regular if and only if a numeric equality, involving only the spectrum of the graph and the numbers of vertices at distance d from each vertex, is satisfied.
متن کاملSpectral Characterizations of Some Distance-Regular Graphs
When can one see from the spectrum of a graph whether it is distance-regular or not? We give some new results for when this is the case. As a consequence we find (among others) that the following distance-regular graphs are uniquely determined by their spectrum: The collinearity graphs of the generalized octagons of order (2, 1), (3, 1) and (4, 1), the Biggs-Smith graph, the M22 graph, and the ...
متن کاملVertex-magic labelings of regular graphs II
Previously the first author has shown how to construct vertexmagic total labelings (VMTLs) for large families of regular graphs. The construction proceeds by successively adding arbitrary 2-factors to a regular graph of order n which possesses a strong VMTL, to produce a regular graph of the same order but larger size. In this paper, we exploit this construction method. We are able to show that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1978
ISSN: 0095-8956
DOI: 10.1016/s0095-8956(78)80013-6